On the asymptotic distribution of the errors in vector quantization
نویسنده
چکیده
In a recent paper, Lee and Neuhoff found an asymptotic formula for the distribution of the length of the errors produced by a vector quantizer with many quantization points. This distribution depends on the source probability density, the quantizer point density and the quantizer shape profile. (The latter characterizes the shapes of the quantization cells as a function of position.) The purpose of this paper is to give a rigorous derivation of this formula by identifying precise conditions under which it is shown that if a sequence of vector quantizers with a given dimension and an increasing number of points has "specific" point densities and "specific" shape profiles converging to a "model" point density and a "model" shape profile, respectively, then the distribution of the length of the quantization error, suitably normalized, converges to the aforementioned formula, with the model point density and the model shape profile substituted.
منابع مشابه
The Time Adaptive Self Organizing Map for Distribution Estimation
The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...
متن کاملAsymptotic Efficiencies of the MLE Based on Bivariate Record Values from Bivariate Normal Distribution
Abstract. Maximum likelihood (ML) estimation based on bivariate record data is considered as the general inference problem. Assume that the process of observing k records is repeated m times, independently. The asymptotic properties including consistency and asymptotic normality of the Maximum Likelihood (ML) estimates of parameters of the underlying distribution is then established, when m is ...
متن کاملAsymptotic Property of Optimal Quantization for System Identification
In this paper, we analyse the asymptotic property of the optimal quantization of signals used for system identification in high resolution case. We show an optimal quantization scheme for minimizing estimation errors under a constraint on the number of subsections of the quantized signals or the expectation of the optimal code length. The optimal quantization schemes can be given by solving Eul...
متن کاملAsymptotic distribution of the errors in scalar and vector quantizers
High-rate (or asymptotic) quantization theory has found formulas for the average squared length (more generally, the q-th moment of the length) of the error produced by various scalar and vector quantizers with many quantization points. In contrast, this paper finds an asymptotic formula for the probability density of the length of the error and, in certain special cases, for the probability de...
متن کاملEstimation of Intrinsic Dimensionality Using High-Rate Vector Quantization
We introduce a technique for dimensionality estimation based on the notion of quantization dimension, which connects the asymptotic optimal quantization error for a probability distribution on a manifold to its intrinsic dimension. The definition of quantization dimension yields a family of estimation algorithms, whose limiting case is equivalent to a recent method based on packing numbers. Usi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 1996